Non-minimal Degree-Sequence-Forcing Triples
نویسندگان
چکیده
منابع مشابه
Non-minimal Degree-Sequence-Forcing Triples
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degreesequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A degreesequence-forcing set is minimal if no proper subset is degree-sequenceforcing. We characterize the non-minimal degree-sequ...
متن کاملForcing Minimal Degree of Constructibility
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملMinimal forbidden sets for degree sequence characterizations
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. Barrus, Kumbhat, and Hartke [4] called F a degree-sequence-forcing (DSF) set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A DSF set is minimal if no proper subset is also DSF. In this paper, we present new properties of m...
متن کاملThe Minimal Number of Subtrees with a Given Degree Sequence
In this paper, we investigate the structures of extremal trees which have the minimal number of subtrees in the set of all trees with a given degree sequence. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence π = (d1, . . . , d5, 1, . . . , 1) have been characterized.
متن کاملPellans Sequence and Its Diophantine Triples
We introduce a novel fourth order linear recurrence sequence {Sn} using the two periodic binary recurrence. We call it “pellans sequence” and then we solve the system ab+ 1 = Sx, ac + 1 = Sy bc+ 1 = Sz where a < b < c are positive integers. Therefore, we extend the order of recurrence sequence for this variant diophantine equations by means of pellans sequence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2014
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-014-1450-0